CS 599 : Structure and Dynamics of Networked Information ( Spring 2005 ) 03 / 07 / 2005 : Power Law Degree Distributions
نویسنده
چکیده
The existence of power law distributions (also known as heavy-tailed distributions) in various natural and man-made scenarios has been demonstrated empirically over the years [6], and attracted a great deal of interest, resulting in models that would naturally predict such distributions. The areas in which power laws have been observed are very diverse, as evidenced by the following, not nearly exhaustive, list:
منابع مشابه
CS 599 : Structure and Dynamics of Networked Information ( Spring 2005 ) 01 / 24 / 2005 : The Efficacy of Collusions in Web Ranking and the Counter - measures
At Google, the rank depends on the product of relevance and importance. It is, however, difficult to say which of the two is a bigger factor in deciding the rank. An SEO can try to manipulate both of these factors in trying to boost the rank of the page. In this lecture, we’re concerned only with efforts to try and increase the importance of the page by manipulating the link structure around th...
متن کاملCS 599 : Structure and Dynamics of Networked Information ( Spring 2005 ) 4 / 4 / 2005 : Epidemic Phenomena
One of the first models studied explicitly in this context was Schelling’s model for segregation [3]. Schelling was motivated by the question: why is it that most neighborhoods are very uniform (racially, and in other respects), even though most people profess that they would prefer to live in a diverse community? Schelling proposed the following model: Assume that roughly n 2 2 individuals liv...
متن کاملCS 599 : Structure and Dynamics of Networked Information ( Spring 2005 )
In the previous lecture, we looked at and analyzed the HITS algorithm, based on Hubs and Authorities. This algorithm was designed with a scenario in mind where authorities might not cite each other (for example, Ford will be very unlikely to link to Chevrolet). Hence, HITS uses the idea of conferring authority indirectly through hubs. In scenarios where authorities do cite each other, such as a...
متن کاملCs599: Structure and Dynamics of Networked Information (spring 2005) 03/09/2005: Power Laws via Optimization Scribes: Ranjit Raveendran and Farnoush Banaei-kashani
In the past lecture, we investigated the preferential attachment model for the generation of power law degree distributions. While “rich-get-richer” models may be considered close to the truth for WWW-like graphs, they do not seem appropriate for graphs such as the Internet, as there appears no natural reason why nodes would choose to attach to high-degree nodes (or be more likely to find out a...
متن کاملCS599: Structure and Dynamics of Networked Information (Spring 2005) 02/02/2005: α-communities
Last time, we looked at a notion of community where we required high overall edge density among groups of nodes. This made no requirement on individual nodes. In particular, the definition favors the inclusion of high-degree nodes (in WWW terms: popular sites, e.g., yahoo.com, google.com, cnn.com). One may argue that communities should consist of nodes which predominantly belong to that communi...
متن کامل